Modeling Self-Organizing, Faulty Peer-to-Peer Systems as Complex Networks

نویسنده

  • Stefano Ferretti
چکیده

The theory of complex networks provides effective mathematical tools for analyzing properties of communication systems. This paper discusses an approach for modeling fault-tolerance in self-organizing peer-to-peer overlays. The evolution of the network is characterized by resorting to a failure and an attachment rate probabilities, together with equations modeling the protocol that peers adopt for the overlay management. Using generating functions, the model is turned into a (partial) differential equation, whose solution provides insights on the nodes’ degree probability distribution. Two protocols are considered, which differ in the way peers create links with others. In the first case, peers create novel links based on a pure probabilistic model while, in the second case, they try to maintain a given number of links, during the evolution. Our outcomes demonstrate that, in presence of node faults, peers cannot easily maintain their own desired degree. In particular, this goal is achieved only when the attachment rate is considerably higher than the failure rate. Numerical results are compared with those obtained through simulation; they confirm the goodness of the approach. Conctact: [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Engineering Self-Organization in Complex Software Systems

Modeling and Engineering Self-Organization in Complex Software Systems Paul L. Snyder Giuseppe Valetto, Ph.D. Describing, understanding, and modeling the emergent behavior of self-organizing software systems remains an open challenge. Such systems can solve problems in computing domains where traditional, centralized models are impractical or problematic, including ubiquitous and pervasive comp...

متن کامل

A Genetic Programming-based trust model for P2P Networks

Abstract— Peer-to-Peer ( P2P ) systems have been the center of attention in recent years due to their advantage . Since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . Therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . This paper investigates the use of genetic ...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network

Network infrastructures are nowadays getting more and more complex as security considerations and technical needs like network address translation are blocking traffic and protocols in IP-based networks. Applications in such networks should transparently overcome these limitations. Examples for such applications range from simple chat clients to collaborative work environments spanning differen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009